- Lagrangian interpolation formula
- интерполяционная формула Лагранжа
Англо-русский словарь промышленной и научной лексики. 2014.
Lagrangian interpolation formula
Смотреть что такое "Lagrangian interpolation formula" в других словарях:
Davidon–Fletcher–Powell formula — The Davidon–Fletcher–Powell formula (or DFP; named after William C. Davidon, Roger Fletcher, and Michael J. D. Powell) finds the solution to the secant equation that is closest to the current estimate and satisfies the curvature condition (see… … Wikipedia
Scientific phenomena named after people — This is a list of scientific phenomena and concepts named after people (eponymous phenomena). For other lists of eponyms, see eponym. NOTOC A* Abderhalden ninhydrin reaction Emil Abderhalden * Abney effect, Abney s law of additivity William de… … Wikipedia
Gottfried Leibniz — Infobox Philosopher region = Western Philosophy era = 18th century philosophy color = #B0C4DE |250px image caption = Gottfried Wilhelm Leibniz name = Gottfried Wilhelm Leibniz birth = 1 July (21 June Old Style) 1646, Leipzig, Electorate of Saxony … Wikipedia
List of mathematics articles (L) — NOTOC L L (complexity) L BFGS L² cohomology L function L game L notation L system L theory L Analyse des Infiniment Petits pour l Intelligence des Lignes Courbes L Hôpital s rule L(R) La Géométrie Labeled graph Labelled enumeration theorem Lack… … Wikipedia
List of numerical analysis topics — This is a list of numerical analysis topics, by Wikipedia page. Contents 1 General 2 Error 3 Elementary and special functions 4 Numerical linear algebra … Wikipedia
Joseph Louis Lagrange — Lagrange redirects here. For other uses, see Lagrange (disambiguation). Joseph Louis Lagrange Joseph Louis (Giuseppe Lodovico), comte de Lagrange … Wikipedia
Newton's method — In numerical analysis, Newton s method (also known as the Newton–Raphson method), named after Isaac Newton and Joseph Raphson, is a method for finding successively better approximations to the roots (or zeroes) of a real valued function. The… … Wikipedia
Dynamic programming — For the programming paradigm, see Dynamic programming language. In mathematics and computer science, dynamic programming is a method for solving complex problems by breaking them down into simpler subproblems. It is applicable to problems… … Wikipedia
Pierre-Simon Laplace — Laplace redirects here. For the city in Louisiana, see LaPlace, Louisiana. For the joint NASA ESA space mission, see Europa Jupiter System Mission. Pierre Simon, marquis de Laplace Pierre Simon Laplace (1749–1827). Posthumous portrait … Wikipedia
Gauss–Newton algorithm — The Gauss–Newton algorithm is a method used to solve non linear least squares problems. It can be seen as a modification of Newton s method for finding a minimum of a function. Unlike Newton s method, the Gauss–Newton algorithm can only be used… … Wikipedia
Nonlinear conjugate gradient method — In numerical optimization, the nonlinear conjugate gradient method generalizes the conjugate gradient method to nonlinear optimization. For a quadratic function : The minimum of f is obtained when the gradient is 0: . Whereas linear conjugate… … Wikipedia
